Computational Soundness of Symbolic Models for Cryptographic Protocols Supervised by Yassine Lakhnech JURY
نویسندگان
چکیده
منابع مشابه
Abstractions pour la vérification de propriétés de sécurité de protocoles cryptographiques. (Abstractions for verification of security properties of cryptographic protocols)
ions pour la vérification de propriétés de sécurité de protocoles cryptographiques Soutenue le 19 septembre 2003 Composition du jury : – Michel Bidoit Directeur de thèse – Paul Gastin Président du jury – Jean Goubault-Larrecq Examinateur – Francis Klay Examinateur – Yassine Lakhnech Rapporteur – Jean-François Raskin Rapporteur
متن کاملComputationally Sound Verification of Security Protocols Using Diffie-Hellman Exponentiation
Recently, it has been proved that computational security can be automatically verified using the Dolev-Yao abstraction. We extend these results by adding a widely used component for cryptographic protocols: Diffie-Hellman exponentiation. Thus our main result is: if the Decisional Diffie-Hellman assumption is verified and the cryptographic primitives used to implement the protocol are secure, th...
متن کاملA symbolic decision procedure for cryptographic protocols with time stamps
We present a symbolic decision procedure for time-sensitive cryptographic protocols. We consider protocols described in a process algebra-like notation that includes clocks, time-stamps and time variables. While the values of all clocks increase with rate one when time passes, time variables are simply variables that range over the time domain and can be used to remember time-stamps, i.e. time ...
متن کاملA Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps (Extended Abstract)
We present a symbolic decision procedure for time-sensitive cryptographic protocols. We consider protocols described in a process algebra-like notation that includes clocks, time-stamps and time variables. While the values of all clocks increase with rate one when time passes, time variables are simply variables that range over the time domain and can be used to remember time-stamps, i.e. time ...
متن کاملCertified Security Proofs of Cryptographic Protocols in the Computational Model: An Application to Intrusion Resilience
Security proofs for cryptographic systems can be carried out in different models which reflect different kinds of security assumptions. In the symbolic model, an attacker cannot guess a secret at all and can only apply a pre-defined set of operations, whereas in the computational model, he can hope to guess secrets and apply any polynomial-time operation. Security properties in the computationa...
متن کامل